On realization graphs of degree sequences
نویسندگان
چکیده
منابع مشابه
On realization graphs of degree sequences
Given the degree sequence d of a graph, the realization graph of d is the graph having as its vertices the labeled realizations of d, with two vertices adjacent if one realization may be obtained from the other via an edge-switching operation. We describe a connection between Cartesian products in realization graphs and the canonical decomposition of degree sequences described by R.I. Tyshkevic...
متن کاملOn the Realization of Degree Sequences in Parallel
When is a sequence of integers realizable as the degree sequence of a graph? There are well known necessary and suucient conditions for a sequence of integers to constitute degrees of a graph 1]. There exists a sequential linear time algorithm that construct a graph from a given degree sequence. This algorithm however seems to be inherenty sequencial, and thus hard to parallelize. In this paper...
متن کاملDegree sequences of monocore graphs
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d1, . . . , dn is the degree sequence of some k-monocore graph G, 0 ≤ k ≤ n− 1, if and only if k ≤ di ≤ min {n− 1, k + n− i} and
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملDegree Sequences of F-Free Graphs
Let F be a fixed graph of chromatic number r + 1. We prove that for all large n the degree sequence of any F -free graph of order n is, in a sense, close to being dominated by the degree sequence of some r-partite graph. We present two different proofs: one goes via the Regularity Lemma and the other uses a more direct counting argument. Although the latter proof is longer, it gives better esti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.03.012